Equilibrium and Potential in Coalitional Congestion Games
نویسندگان
چکیده
The model of congestion games is widely used to analyze games related to traffic and communication. A central property of these games is that they are potential games and hence posses a pure Nash equilibrium. In reality it is often the case that some players cooperatively decide on their joint action in order to maximize the coalition’s total utility. This is by modeled by Coalitional Congestion Games. Typical settings include truck drivers who work for the same shipping company, or routers that belong to the same ISP. The formation of coalitions will typically imply that the resulting coalitional congestion game will no longer posses a pure Nash equilibrium. In this paper we provide conditions under which such games are potential games and posses a pure Nash equilibrium. JEL classification: C72
منابع مشابه
Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games
Bottleneck congestion games properly model the properties of many real-world network routing applications. They are known to possess strong equilibria – a strengthening of Nash equilibrium to resilience against coalitional deviations. In this paper, we study the computational complexity of pure Nash and strong equilibria in these games. We provide a generic centralized algorithm to compute stro...
متن کاملStability scores: measuring coalitional stability
We introduce a measure for the level of stability against coalitional deviations, called stability scores, which generalizes widely used notions of stability in non-cooperative games. We use the proposed measure to compare various Nash equilibria in congestion games, and to quantify the effect of game parameters on coalitional stability. For our main results, we apply stability scores to analyz...
متن کاملSocial Context Games
We introduce the study of social context games. A social context game is defined by an underlying game in strategic form, and a social context consisting of an undirected graph of neighborhood among players and aggregation functions. The players and strategies in a social context game are as in the underlying game, while the players’ utilities in a social context game are computed from their pa...
متن کاملComputing approximate pure Nash equilibria in weighted congestion games with polynomial latency functions
We present an efficient algorithm for computing O(1)-approximate pure Nash equilibria in weighted congestion games with polynomial latency functions of constant maximum degree. For games with linear latency functions, the approximation guarantee is 3+ √ 5 2 + O(γ) for arbitrarily small γ > 0; for latency functions of maximum degree d, it is d. The running time is polynomial in the number of bit...
متن کاملStrong Price of Anarchy and Coalitional Dynamics
We introduce a framework for studying the effect of cooperation on the quality of outcomes in utility games. Our framework is a coalitional analog of the smoothness framework of noncooperative games. Coalitional smoothness implies bounds on the strong price of anarchy, the loss of quality of coalitionally stable outcomes, as well as bounds on coalitional versions of coarse correlated equilibria...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1111.3933 شماره
صفحات -
تاریخ انتشار 2011